71. Simplify Path - LeetCode Solution


String Stack

Python Code:

class Solution:
    def simplifyPath(self, path: str) -> str:
        stack = ["/",]



        path = path.split("/")

        for i in range(len(path)):
            if(path[i] == "." or path[i] == ""):
                continue
            else:
                if(path[i] == ".."):
                    if(len(stack) == 1):
                        continue
                    else:
                        stack.pop()
                        stack.pop()
                else:
                    stack.append(path[i])
                    stack.append("/")



        stack = "".join(stack)

        if(len(stack) == 1):
            return "/"
        else:

            return stack[:len(stack) -1]


Comments

Submit
0 Comments
More Questions

1463B - Find The Array
1538C - Number of Pairs
621B - Wet Shark and Bishops
476B - Dreamoon and WiFi
152C - Pocket Book
1681D - Required Length
1725D - Deducing Sortability
1501A - Alexey and Train
721B - Passwords
1263D - Secret Passwords
1371B - Magical Calendar
1726E - Almost Perfect
1360C - Similar Pairs
900A - Find Extra One
1093D - Beautiful Graph
748A - Santa Claus and a Place in a Class
1511B - GCD Length
676B - Pyramid of Glasses
597A - Divisibility
1632A - ABC
1619D - New Year's Problem
242B - Big Segment
938A - Word Correction
159C - String Manipulation 10
258A - Little Elephant and Bits
1536C - Diluc and Kaeya
1428C - ABBB
1557A - Ezzat and Two Subsequences
255A - Greg's Workout
1059A - Cashier